// SPDX-License-Identifier: GPL-2.0-or-later
// Copyright © EDF R&D / TELECOM ParisTech (ENST-TSI)

#include <BoundingBox.h>

//STL
#include <algorithm>
#include <cstdint>

using namespace CCCoreLib;

BoundingBox::BoundingBox()
	: m_bbMin(0, 0, 0)
	, m_bbMax(0, 0, 0)
	, m_valid(false)
{}

BoundingBox::BoundingBox(const CCVector3& bbMinCorner, const CCVector3& bbMaxCorner)
	: m_bbMin(bbMinCorner)
	, m_bbMax(bbMaxCorner)
	, m_valid(true)
{}

void BoundingBox::clear()
{
	m_bbMin = m_bbMax = CCVector3(0, 0, 0);
	m_valid = false;
}

CCVector3 BoundingBox::getCenter() const
{
	return (m_bbMax + m_bbMin) * static_cast<PointCoordinateType>(0.5);
}

CCVector3 BoundingBox::getDiagVec() const
{
	return (m_bbMax - m_bbMin);
}

PointCoordinateType BoundingBox::getMinBoxDim() const
{
	CCVector3 V = getDiagVec();

	return std::min(V.x, std::min(V.y, V.z));
}

PointCoordinateType BoundingBox::getMaxBoxDim() const
{
	CCVector3 V = getDiagVec();

	return std::max(V.x, std::max(V.y, V.z));
}

double BoundingBox::computeVolume() const
{
	CCVector3 V = getDiagVec();

	return static_cast<double>(V.x) * static_cast<double>(V.y) * static_cast<double>(V.z);
}

BoundingBox BoundingBox::operator + (const BoundingBox& aBBox) const
{
	if (!m_valid)
		return aBBox;
	if (!aBBox.isValid())
		return *this;

	BoundingBox tempBox;
	{
		tempBox.m_bbMin.x = std::min(m_bbMin.x, aBBox.m_bbMin.x);
		tempBox.m_bbMin.y = std::min(m_bbMin.y, aBBox.m_bbMin.y);
		tempBox.m_bbMin.z = std::min(m_bbMin.z, aBBox.m_bbMin.z);
		tempBox.m_bbMax.x = std::max(m_bbMax.x, aBBox.m_bbMax.x);
		tempBox.m_bbMax.y = std::max(m_bbMax.y, aBBox.m_bbMax.y);
		tempBox.m_bbMax.z = std::max(m_bbMax.z, aBBox.m_bbMax.z);
		tempBox.setValidity(true);
	}

	return tempBox;
}

const BoundingBox& BoundingBox::operator += (const BoundingBox& aBBox)
{
	if (aBBox.isValid())
	{
		add(aBBox.minCorner());
		add(aBBox.maxCorner());
	}

	return *this;
}

const BoundingBox& BoundingBox::operator += (const CCVector3& aVector)
{
	if (m_valid)
	{
		m_bbMin += aVector;
		m_bbMax += aVector;
	}

	return *this;
}

const BoundingBox& BoundingBox::operator -= (const CCVector3& aVector)
{
	if (m_valid)
	{
		m_bbMin -= aVector;
		m_bbMax -= aVector;
	}

	return *this;
}

const BoundingBox& BoundingBox::operator *= (PointCoordinateType scaleFactor)
{
	if (m_valid)
	{
		m_bbMin *= scaleFactor;
		m_bbMax *= scaleFactor;
	}

	return *this;
}

void BoundingBox::add(const CCVector3& aPoint)
{
	if (m_valid)
	{
		if (aPoint.x < m_bbMin.x)
			m_bbMin.x = aPoint.x;
		else if (aPoint.x > m_bbMax.x)
			m_bbMax.x = aPoint.x;

		if (aPoint.y < m_bbMin.y)
			m_bbMin.y = aPoint.y;
		else if (aPoint.y > m_bbMax.y)
			m_bbMax.y = aPoint.y;

		if (aPoint.z < m_bbMin.z)
			m_bbMin.z = aPoint.z;
		else if (aPoint.z > m_bbMax.z)
			m_bbMax.z = aPoint.z;
	}
	else
	{
		m_bbMax = m_bbMin = aPoint;
		m_valid = true;
	}
}

PointCoordinateType BoundingBox::minDistTo(const BoundingBox& box) const
{
	if (m_valid && box.isValid())
	{
		CCVector3 d(0, 0, 0);

		for (uint8_t dim = 0; dim < 3; ++dim)
		{
			//if the boxes overlap in one dimension, the distance is zero (in this dimension)
			if (box.m_bbMin.u[dim] > m_bbMax.u[dim])
				d.u[dim] = box.m_bbMin.u[dim] - m_bbMax.u[dim];
			else if (box.m_bbMax.u[dim] < m_bbMin.u[dim])
				d.u[dim] = m_bbMin.u[dim] - box.m_bbMax.u[dim];
		}

		return d.norm();
	}
	else
	{
		return std::numeric_limits<PointCoordinateType>::quiet_NaN();
	}
}

const BoundingBox& BoundingBox::operator *= (const SquareMatrix& mat)
{
	if (m_valid)
	{
		CCVector3 boxCorners[8];

		boxCorners[0] = m_bbMin;
		boxCorners[1] = CCVector3(m_bbMin.x, m_bbMin.y, m_bbMax.z);
		boxCorners[2] = CCVector3(m_bbMin.x, m_bbMax.y, m_bbMin.z);
		boxCorners[3] = CCVector3(m_bbMax.x, m_bbMin.y, m_bbMin.z);
		boxCorners[4] = m_bbMax;
		boxCorners[5] = CCVector3(m_bbMin.x, m_bbMax.y, m_bbMax.z);
		boxCorners[6] = CCVector3(m_bbMax.x, m_bbMax.y, m_bbMin.z);
		boxCorners[7] = CCVector3(m_bbMax.x, m_bbMin.y, m_bbMax.z);

		clear();

		for (int i = 0; i < 8; ++i)
		{
			add(mat*boxCorners[i]);
		}
	}

	return *this;
}

